HIERARCHICAL CLUSTERING APPROACH WITH HYBRID GENETIC ALGORITHM FOR COMBINATORIAL OPTIMIZATION PROBLEMS
نویسندگان
چکیده
منابع مشابه
Hierarchical Clustering Approach with Hybrid Genetic Algorithm for Combinatorial Optimization Problems
Engineering field has inherently many combinatorial optimization problems which are hard to solve in some definite interval of time especially when input size is big. Although traditional algorithms yield most optimal answers, they need large amount of time to solve the problems. A new branch of algorithms known as evolutionary algorithms solve these problems in less time. Such algorithms have ...
متن کاملHybrid Genetic Algorithm with PSO Effect for Combinatorial Optimisation Problems
In engineering field, many problems are hard to solve in some definite interval of time. These problems known as “combinatorial optimisation problems” are of the category NP. These problems are easy to solve in some polynomial time when input size is small but as input size grows problems become toughest to solve in some definite interval of time. Long known conventional methods are not able to...
متن کاملHybrid Genetic Algorithm with K-Means for Clustering Problems
The K-means method is one of the most widely used clustering methods and has been implemented in many fields of science and technology. One of the major problems of the k-means algorithm is that it may produce empty clusters depending on initial center vectors. Genetic Algorithms (GAs) are adaptive heuristic search algorithm based on the evolutionary principles of natural selection and genetics...
متن کاملAn Optimization K-Modes Clustering Algorithm with Elephant Herding Optimization Algorithm for Crime Clustering
The detection and prevention of crime, in the past few decades, required several years of research and analysis. However, today, thanks to smart systems based on data mining techniques, it is possible to detect and prevent crime in a considerably less time. Classification and clustering-based smart techniques can classify and cluster the crime-related samples. The most important factor in the c...
متن کاملAdaptive Quantum Inspired Genetic Algorithm for Combinatorial Optimization Problems
The development in the field of quantum computing gives us a significant edge over classical computing in terms of time and efficiency. This is particularly useful for NP-hard problems such as graph layout problems. Since many real world problems are effectively solved by genetic algorithm (GA) and the performance of GA highly depends upon the setting of its parameters, therefore this paper foc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer and Communication Technology
سال: 2016
ISSN: 2231-0371,0975-7449
DOI: 10.47893/ijcct.2016.1370